Hadwiger’s conjecture on special classes of graphs
نویسندگان
چکیده
The Hadwiger number of a graph G is the largest integer n for which the complete graph on n vertices is a minor of G. Hadwiger conjectured that for any graph G, ,where is the chromatic number of G. We will address Hadwiger’s conjecture for circular arc graphs and their subfamilies. Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc.
منابع مشابه
Hadwiger's Conjecture for the Complements of Kneser Graphs
A graph H is a minor of a graph G if a graph isomorphic to H can be obtained from a subgraph of G by contracting edges. An H-minor is a minor isomorphic to H. The Hadwiger number of G, denoted by h(G), is the maximum integer t such that G contains a Kt-minor, where Kt is the complete graph with t vertices. Hadwiger [8] conjectured that every graph that is not (t−1)-colourable contains a Kt-mino...
متن کاملA note on the Hadwiger number of circular arc graphs
The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger’s conjecture states that η(G) ≥ χ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the...
متن کاملOn a special case of Hadwiger's conjecture
Hadwiger’s Conjecture seems difficult to attack, even in the very special case of graphs G of independence number α(G) = 2. We present some results in this special case.
متن کاملAn Approach to Hadwiger's Conjecture through Squares of Chordal Graphs
Hadwiger’s conjecture states that for every graph G, χ(G) ≤ η(G), where χ(G) is the chromatic number and η(G) is the size of the largest clique minor in G. In this work, we show that to prove Hadwiger’s conjecture in general, it is sufficient to prove Hadwiger’s conjecture for the class of graphs F defined as follows: F is the set of all graphs that can be expressed as the square graph of a spl...
متن کاملHadwiger Number and the Cartesian Product Operation on Graphs
The Hadwiger number η(G) of a graph G is defined as the largest integer n for which the complete graph on n nodes Kn is a minor of G. Hadwiger conjectured that for any graph G, η(G) ≥ χ(G),where χ(G) is the chromatic number of G. In this paper, we investigate the Hadwiger number with respect to the cartesian product operation on Graphs. As the main result of this paper, we show that for any two...
متن کامل